Multilevel sparse kernel-based interpolation using conditionally positive definite radial basis functions
نویسندگان
چکیده
A multilevel sparse kernel-based interpolation (MLSKI) method, suitable for moderately high-dimensional function interpolation problems has been recently proposed in [15]. The method uses both level-wise and direction-wise multilevel decomposition of structured or mildly unstructured interpolation data sites in conjunction with the application of kernel-based interpolants with different scaling in each direction. The multilevel interpolation algorithm is based on a hierarchical decomposition of the data sites, whereby at each level the detail is added to the interpolant by interpolating the resulting residual of the previous level. On each level, anisotropic radial basis functions (RBFs) are used for solving a number of small interpolation problems, which are subsequently linearly combined to produce the interpolant. Here, we investigate the use of conditionally positive definite RBFs within the MLSKI setting, thus extending the results from [15], where (strictly) positive definite RBFs are used only.
منابع مشابه
Multilevel Sparse Kernel-Based Interpolation
A multilevel kernel-based interpolation method, suitable for moderately high-dimensional function interpolation problems, is proposed. The method, termed multilevel sparse kernelbased interpolation (MLSKI, for short), uses both level-wise and direction-wise multilevel decomposition of structured (or mildly unstructured) interpolation data sites in conjunction with the application of kernel-base...
متن کاملPointwise Estimates Formultivariate Interpolation Using Conditionally Positive Definite Functions
We seek pointwise error estimates for interpolants, on scattered data, constructed using a basis of conditionally positive deenite functions of order m, and polynomials of degree not exceeding m-1. Two diierent approaches to the analysis of such interpolation are considered. The former uses distributions and reproducing kernel ideas, whilst the latter is based on a Lagrange function approach. E...
متن کاملFast Solution of the Radial Basis Function Interpolation Equations: Domain Decomposition Methods
In this paper we consider domain decomposition methods for solving the radial basis function interpolation equations. There are three interwoven threads to the paper. The first thread provides good ways of setting up and solving smallto medium-sized radial basis function interpolation problems. These may occur as subproblems in a domain decomposition solution of a larger interpolation problem. ...
متن کاملInterpolation by Basis Functions of Different Scales and Shapes
Under very mild additional assumptions, translates of conditionally positive definite radial basis functions allow unique interpolation to scattered multivariate data, because the interpolation matrices have a symmetric and positive definite dominant part. In many applications, the data density varies locally, and then the translates should get different scalings that match the local data densi...
متن کاملA meshless technique for nonlinear Volterra-Fredholm integral equations via hybrid of radial basis functions
In this paper, an effective technique is proposed to determine thenumerical solution of nonlinear Volterra-Fredholm integralequations (VFIEs) which is based on interpolation by the hybrid ofradial basis functions (RBFs) including both inverse multiquadrics(IMQs), hyperbolic secant (Sechs) and strictly positive definitefunctions. Zeros of the shifted Legendre polynomial are used asthe collocatio...
متن کامل